Conditional Existence of Variables in Generalized Constraint Networks∗
نویسندگان
چکیده
Classical constraint systems require that the set of variables which exist in a problem be known ab initio. However, there are some applications in which the existence of certain variables is dependent on conditions whose truth or falsity can only be determined dynamically. In this paper, we show how this conditional existence of variables can be handled in a mathematically well-founded fashion by viewing a constraint network as a set of sentences in free logic. Based on these ideas, we have developed, implemented and applied, a constraint language in which any sentence in full first-order free logic, about a many-sorted universe of discourse which subsumes <, is a well-formed constraint.
منابع مشابه
Conditional Existence of Variables in Generalised Constraint Networks
Classical constraint systems require that the set of variables which exist in a problem be known ab initio. However, there are some applications in which the existence of certain variables is dependent on conditions whose truth or falsity can only be determined dynamically. In this paper, we show how this conditional existence of variables can be handled in a mathematically well-founded fashion...
متن کاملConditional Random Fields, Planted Constraint Satisfaction and Entropy Concentration
This paper studies a class of probabilistic models on graphs, where edge variables depend on incident node variables through a fixed probability kernel. The class includes planted constraint satisfaction problems (CSPs), as well as more general structures motivated by coding and community clustering problems. It is shown that under mild assumptions on the kernel and for sparse random graphs, th...
متن کاملConditional Random Fields, Planted Satisfaction, and Entropy Concentration
This paper studies a class of probabilistic models on graphs, where edge variables depend on incident node variables through a fixed probability kernel. The class includes planted constraint satisfaction problems (CSPs), as well as more general structures motivated by coding and community clustering problems. It is shown that under mild assumptions on the kernel, the conditional entropy of the ...
متن کاملA Mathematical Optimization Model for Solving Minimum Ordering Problem with Constraint Analysis and some Generalizations
In this paper, a mathematical method is proposed to formulate a generalized ordering problem. This model is formed as a linear optimization model in which some variables are binary. The constraints of the problem have been analyzed with the emphasis on the assessment of their importance in the formulation. On the one hand, these constraints enforce conditions on an arbitrary subgraph and then g...
متن کاملAn iterative method for the Hermitian-generalized Hamiltonian solutions to the inverse problem AX=B with a submatrix constraint
In this paper, an iterative method is proposed for solving the matrix inverse problem $AX=B$ for Hermitian-generalized Hamiltonian matrices with a submatrix constraint. By this iterative method, for any initial matrix $A_0$, a solution $A^*$ can be obtained in finite iteration steps in the absence of roundoff errors, and the solution with least norm can be obtained by choosing a special kind of...
متن کامل